String pattern-matching in Prolog
نویسندگان
چکیده
منابع مشابه
Pattern Recognition and String Matching
4 String Design 5 4.1 Maximum Distance Code . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Equidistant code and Bayes rule . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Equidistant code and unbiased distance . . . . . . . . . . . . . . . . . . 7 4.4 Summary of Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.5 Code Sensitivity . . . . . . . . . . . . . . . . . ...
متن کاملModels of String Pattern Matching
1. Introduction In an earlier report [1], a model for string pattern matching in the style of SNOBOL4 was developed using Icon. That report showed how most of the pattern-matching mechanism of SNOBOL4 could be translated into Icon and, in effect, provided a model for implementing pattern matching in the style of SNOBOL4.
متن کاملA Fast Multiple String-pattern Matching Algorithm
In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...
متن کاملString Pattern Matching Fora Deluge Survival
String Pattern Matching concerns itself with algorithmic and combi-natorial issues related to matching and searching on linearly arranged sequences of symbols, arguably the simplest possible discrete structures. As unprecedented volumes of sequence data are amassed, disseminated and shared at an increasing pace, eeective access to, and manipulation of such data depend crucially on the eeciency ...
متن کاملEfficient implementation of Unicode string pattern matching automata in Java
We study different efficient implementations of an Aho-Corasick pattern matching automaton when searching for patterns in Unicode text. Much of the previous research has been based on the assumption of a relatively small alphabet, for example the 7-bit ASCII. Our aim is to examine the differences in performance arising from the use of a large alphabet, like the 16-bit Unicode that is widely use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Languages
سال: 1988
ISSN: 0096-0551
DOI: 10.1016/0096-0551(88)90022-7